(0) Obligation:
Clauses:
p(X, Y, Z) :- ','(=(X, Y), ','(=(Z, 1), !)).
p(X, Y, Z) :- ','(=(Z, 1), ','(=(Y, X), p(X, Y, Z))).
=(X, X).
Query: p(a,a,a)
(1) BuiltinConflictTransformerProof (EQUIVALENT transformation)
Renamed defined predicates conflicting with built-in predicates [PROLOG].
(2) Obligation:
Clauses:
p(X, Y, Z) :- ','(user_defined_=(X, Y), ','(user_defined_=(Z, 1), !)).
p(X, Y, Z) :- ','(user_defined_=(Z, 1), ','(user_defined_=(Y, X), p(X, Y, Z))).
user_defined_=(X, X).
Query: p(a,a,a)
(3) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph DT10.
(4) Obligation:
Triples:
pB(X1, X1, 1) :- pA(X1).
pB(X1, X1, 1) :- pA(X1).
Clauses:
pcA(X1).
Afs:
pB(x1, x2, x3) = pB
(5) UndefinedPredicateInTriplesTransformerProof (SOUND transformation)
Deleted triples and predicates having undefined goals [DT09].
(6) Obligation:
Triples:
Clauses:
pcA(X1).
Afs:
pB(x1, x2, x3) = pB
(7) TPisEmptyProof (EQUIVALENT transformation)
There are no more dependency triples. Hence, the dependency triple problem trivially terminates.
(8) YES